A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
نویسندگان
چکیده
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at the problem with only one resource. We show how to adapt the procedure by Van den Akker et al. [1] for the problem of minimizing maximum lateness on a set of identical, parallel machines such that it can be used to solve these RCPS problems. We then consider a number of variants of the RCPS problem with one or more resources and show how these can be solved by our approach. Because of the close relation between RCPS and the cumulative constraint in constraint programming, our method can be used as an efficient filtering algorithm for the cumulative constraint as well. 1980 Mathematics Subject Classification (Revision 1991): 90B35.
منابع مشابه
An Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملModeling and Solution Procedure for a Preemptive Multi-Objective Multi-Mode Project Scheduling Model in Resource Investment Problems
In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کامل